Clustering Within Timetabling Conflict Graphs
نویسندگان
چکیده
A key concept in timetabling problems is that of the conflict graph with edges representing pairs of events that are not allowed to occur at the same time. Usually, the only information presented about such graphs is their density. However, intuitively, it seems likely that such graphs are structured, and most likely have some clustering. In analysing the structure of social networks or of the world-wide web it is common to use various measures. Amongst these is the “clustering coefficient”. We propose using this coefficient in order to analyse timetabling conflict graphs, and give results showing that on some common benchmarks the graphs are indeed clustered by this measure.
منابع مشابه
Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملGenerating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملSemidefinite Programming Relaxations in Timetabling
This paper extends semidefinite programming relaxations of graph colouring to bounded graph colouring and extensions encountered in timetabling, where room sizes, room features, room stability, and pre-allocated assignments are considered. A matrix-free implementation of an augmented Lagrangian method is presented. Encouraging computational results are reported for conflict graphs from all thre...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملThe design and implementation of an interactive course-timetabling system
We describe the design and implementation of a multi-objective course-timetabling system for the Science Division at Rollins College. In the traditional vertex-coloring approach to timetabling, all conflicts are regarded as equally undesirable, but when all such conflicts are considered, including those that might involve only one or two students, a conflict-free timetable is rarely attainable....
متن کامل